reducible space

См. также в других словарях:

• Space group — In mathematics and geometry, a space group is a symmetry group, usually for three dimensions, that divides space into discrete repeatable domains. In three dimensions, there are 219 unique types, or counted as 230 if chiral copies are considered… …   Wikipedia

• Classifying space — In mathematics, specifically in homotopy theory, a classifying space BG of a topological group G is the quotient of a weakly contractible space EG (i.e. a topological space for which all its homotopy groups are trivial) by a free action of G. It… …   Wikipedia

• Log-space reduction — In computational complexity theory, a log space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually, this means it can keep a constant number of pointers into the input, along with a… …   Wikipedia

• Relation reduction — In logic and mathematics, relation reduction and relational reducibility have to do with the extent to which a given relation is determined by an indexed family or a sequence of other relations, called the relation dataset . The relation under… …   Wikipedia

• Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… …   Wikipedia

• Many-one reduction — In computability theory and computational complexity theory, a many one reduction is a reduction which converts instances of one decision problem into instances of a second decision problem. Reductions are thus used to measure the relative… …   Wikipedia

• Heegaard splitting — In the mathematical field of geometric topology, a Heegaard splitting is a decomposition of a compact oriented 3 manifold that results from dividing it into two handlebodies. The importance of Heegaard splittings has grown in recent years as more …   Wikipedia

• Reduction (philosophy) — Reduction is the process by which one object, property, concept, theory, etc., is shown to be explicable in terms of another, higher level, concept, object, property, etc. For example, we say that chemical properties such as the boiling point of… …   Wikipedia

• Irreducible component — In mathematics, the concept of irreducible component is used to make formal the idea that a set such as defined by the equation: XY = 0is the union of the two lines: X = 0and : Y = 0.The notion of irreducibility is stronger than connectedness.… …   Wikipedia

• Degenerate conic — Main article: Conic section In mathematics, a degenerate conic is a conic (degree 2 plane curve, the zeros of a degree 2 polynomial equation, a quadratic) that fails to be an irreducible curve. This can happen in two ways: either it is a… …   Wikipedia

• Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… …   Wikipedia